DNA Computing - Foundations and Implications

نویسندگان

  • Lila Kari
  • Shinnosuke Seki
  • Petr Sosík
چکیده

DNA computing is an area of natural computing based on the idea that molecular biology processes can be used to perform arithmetic and logic operations on information encoded as DNA strands. The aim of this review is two-fold. First, we introduce the fundamentals of DNA computing, including basics of DNA structure and bio-operations, and two historically important DNA computing experiments. Secondly, we describe some of the ways in which DNA computing research has impacted fields in theoretical computer science. The first part of this review outlines basic molecular biology notions necessary for understanding DNA computing (Section 2), recounts the first experimental demonstration of DNA computing (Section 3), as well as the milestone wet laboratory experiment that first demonstrated the potential of DNA computing to outperform the computational ability of an unaided human (Section 4). The second part of the review describes how the properties of DNA-based information, and in particular the Watson-Crick complementarity of DNA single strands, have influenced areas of theoretical computer science such as formal language theory, coding theory, automata theory and combinatorics on words. More precisely, Section 5 summarizes notions and results in formal language theory and coding theory arising from the problem of design of optimal encodings for DNA computing experiments: Section 5.1 describes the problem of DNA encodings design, Section 5.2 consists of an analysis of intramolecular bonds (bonds within a given DNA strand), Section 5.3 defines and characterizes languages that avoid certain undesirable intermolecular bonds (bonds between two or more DNA strands), and Section 5.4 investigates languages whose words avoid even imperfect bindings between their constituent strands. Section 6 contains another, vectorial, representation of DNA strands and two computational models based on this representation: sticker systems and Watson-Crick automata. After a brief description of the representation of DNA partial double strands as two-line vectors, and of the sticking operation that combines them, Section 6.1 describes basic sticker systems, sticker systems

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

متن کامل

Prestige and Dominance as Differential Correlates of Moral Foundations and Its Clinical Implications

Objective: The ways people use for social rank (dominance vs prestige) could explain difference attitude toward five moral foundations. The aim of this study was to investigate the differential relationship between prestige, dominance and moral foundations. Methods: This study conducted with 150 participants who respond to the moral foundation questionnaire and dominance-prestige scale. Multip...

متن کامل

Fault Tolerant DNA Computing Based on ‎Digital Microfluidic Biochips

   Historically, DNA molecules have been known as the building blocks of life, later on in 1994, Leonard Adelman introduced a technique to utilize DNA molecules for a new kind of computation. According to the massive parallelism, huge storage capacity and the ability of using the DNA molecules inside the living tissue, this type of computation is applied in many application areas such as me...

متن کامل

DNA-Based Active Logic Design and Its Implications

DNA computing is an emerging field of research in which biochemistry and molecular biology elements are utilized to complete computational processes performed by traditional silicon-based technologies. Current DNA-based circuits are nonhomogenous, consisting of discrete combinatorial gates with corresponding static processing abilities. This research focuses on further developing DNA-based meth...

متن کامل

Bearing Capacity of Shallow Foundations on Cohesionless Soils: A Random Forest Based Approach

Determining the ultimate bearing capacity (UBC) is vital for design of shallow foundations. Recently, soft computing methods (i.e. artificial neural networks and support vector machines) have been used for this purpose. In this paper, Random Forest (RF) is utilized as a tree-based ensemble classifier for predicting the UBC of shallow foundations on cohesionless soils. The inputs of model are wi...

متن کامل

Parallelizing Assignment Problem with DNA Strands

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012